Justification logics and hybrid logics

Justification logics and hybrid logics

Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, w...

Justification Logics and Conservative Extensions

Several justification logics have evolved, starting with the logic LP, [2]. These can be thought of as explicit versions of modal logics, or logics of knowledge or belief in which the unanalyzed necessity operator has been replaced with a family of explicit justification terms. Modal logics come in various strengths. For their corresponding justification logics, differing strength is reflected ...

Justification Logics with Common Knowledge

Decidability for Justification Logics Revisited

Justification logics are propositional modal-like logics that instead of statements A is known include statements of the form A is known for reason t where the term t can represent an informal justification for A or a formal proof of A. In our present work, we introduce model-theoretic tools, namely: filtrations and a certain form of generated submodels, in the context of justification logic in...

Hybrid Logics

Hybrid languages are modal languages that have special symbols for naming individual states in models. Their history can be traced back to work of Arthur Prior in the fifties. The subject has recently regained interest, resulting in many new results and techniques. This chapter contains a modern overview of the field. We sketch its history, and survey the basic properties of various hybrid lang...